Proceedings of the ACM SIGPLAN Workshop on Continuations CW 92
نویسندگان
چکیده
In a call-by-value language with first-class continuations, the usual CBV fixpoint combinator can be expressed in terms of a simpler iteration primitive. We give an informal derivation of this correspondence, together with a formal correctness proof. We also present a number of generalizations and possible applications.
منابع مشابه
An Operational Foundation for Delimited Continuations
We derive an abstract machine that corresponds to a definitional interpreter for the control operators shift and reset. Based on this abstract machine, we construct a syntactic theory of delimited continuations. Both the derivation and the construction scale to the family of control operators shiftn and resetn. The definitional interpreter for shiftn and resetn has n + 1 layers of continuations...
متن کاملAAIP 2009 Proceedings of the ACM SIGPLAN Workshop on Approaches and Applications of Inductive Programming
It is a well known fact that there is a correspondence between propositions and type, and similarly a correspondence between a proof of a proposition and a program of a type; this is the Curry-Howard correspondence. In this talk I will describe a program, Djinn, which takes a Haskell type and produces a program of that type, using the Curry-Howard correspondence. For the subset of Haskell types...
متن کاملCompleteness of Continuation Models for lm-Calculus
We show that a certain simple call-by-name continuation semantics of Parigot’s λμ-calculus is complete. More precisely, for every λμ-theory we construct a cartesian closed category such that the ensuing continuation-style interpretation of λμ, which maps terms to functions sending abstract continuations to responses, is full and faithful. Thus, any λμ-category in the sense of L. Ong (1996, in “...
متن کاملLocal CPS conversion
Local CPS conversion is a compiler transformation for improving the code generated for nested loops by a direct-style compiler. The transformation consists of a combination of CPS conversion and light-weight closure conversion, which allows the compiler to merge the environments of nested recursive functions. This merging, in turn, allows the backend to use a single machine-level procedure to i...
متن کاملVisualization and graphical layout in object-oriented systems
This report describes a new approach to visualizing program systems within the objectoriented paradigm. This approach is based on a TEX-like notation which has been extended and generalized for specifying graphical layout of arbitrary objects. Our simplest scheme offers specifications similar to TEX’s box-and-glue metaphor. Size and position of boxes and glue can be specified by constraints. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998